A Representation of a Family of Secret Sharing Matroids

Deciding whether a matroid is secret sharing or not is a well-known open problem. In Ng and Walker [6] it was shown that a matroid decomposes into uniform matroids under strong connectivity. The question then becomes as follows: when is a matroid m with N uniform components secret sharing? When N = 1, m corresponds to a uniform matroid and hence is secret sharing. In this paper we show, by constructing a representation using projective geometry, that all connected matroids with two uniform components are secret sharing     

亚纯函数及其k阶导数的唯一性

本文研究具有特殊亏量关系的亚纯函数与其k阶导数分担小函数集合的唯一性，改进，推广了李江涛，顾永兴，杨重骏，仪洪勋等人的有关结果.     

非终身免疫传染病模型解的适定性

本文将讨论非终生免疫性传染病模型解的适定性及正则性；同时证明了整体解的存在，以及解对初值的连续依赖。     

Weighted sharing three values and Brosch's theorem

This paper studies the idea of weighted sharing and proves two main theorems which generalize some results given by G. Brosch, Q. Zhang and other authors.     

居民收入和消费预测的灰理论方法

阐述灰色模型GM(1,1)建立及检验的基本理论和方法.并依据2000年—2005年浙江农村居民人均纯收入和人均生活消费数据,利用GM(1,1)模型建模方法,对“十一五”期间浙江农民的纯收入和生活消费进行了预测.     

Large deviations of sojourn times in processor sharing queues

This paper presents a large deviation analysis of the steady-state sojourn time distribution in the GI/G/1 PS queue. Logarithmic estimates are obtained under the assumption of the service time distribution having a light tail, thus supplementing recent results for the heavy-tailed setting. Our proof gives insight into the way a large sojourn time occurs, enabling the construction of an (asymptotically efficient) importance sampling algorithm. Finally our results for PS are compared to a number of other service disciplines, such as FCFS, LCFS, and SRPT. 2000 mathematics subject classification: 60K25.     

Secret sharing schemes on access structures with intersection number equal to one

The characterization of ideal access structures and the search for bounds on the optimal information rate are two important problems in secret sharing. These problems are studied in this paper for access structures with intersection number equal to one, that is, structures such that there is at most one participant in the intersection of any two different minimal qualified subsets. The main result in this work is the complete characterization of the ideal access structures with intersection number equal to one. In addition, bounds on the optimal information rate are provided for the non-ideal case.     

绿色供应链中消费者信用支付策略研究

本文考虑了一个由单一供应商和单一电商平台组成的绿色供应链,分析了三种不同支付策略(立即支付策略、分期付款策略以及最低还款策略)对供应链成员最优决策和利润的影响。研究表明:(1)免息期敏感系数对绿色营销水平和供应链成员利润均有正向影响。(2)信用支付会使产品产生溢价现象。但在一定条件下,信用支付策略可同时提高供应链成员利润和绿色营销水平,实现经济绩效和环境绩效的双赢。(3)手续费率较高时,若信用期限系数较小,立即支付策略最优;若信用期限系数适中,分期付款策略最优;否则最低还款策略最优。手续费率较低且信用期较小时,最低还款策略最优,否则立即支付策略最优。在此基础上,针对两种信用支付模型设计了成本分担和收益共享的组合契约,实现了供应链协调。     

考虑大数据营销和风险规避的绿色供应链决策与协调

通过建立考虑大数据营销及零售商风险规避的博弈模型,对绿色供应链定价、产品绿色度及利润进行比较分析。研究发现:无论集中决策、双方风险中性分散决策还是仅零售商风险规避分散决策,考虑大数据营销时的供应链整体期望利润和产品绿色度较高,且大数据营销效率因子对产品绿色度的增加有正向作用;双方风险中性分散决策下,一定条件下,两部定价契约能够有效协调供应链整体利润,实现帕累托改进;仅零售商风险规避分散决策下,零售商的风险规避行为会降低其对大数据营销的投入,一定条件下,两部定价契约也能够实现供应链整体期望利润的帕累托改进。     

高管薪酬监督博弈与独立董事有效性研究

研究聚焦董事会内部沟通网络,基于独立董事信息共享机制探讨对高管薪酬的监督效果。研究发现,独立董事相互之间通过共享信息来增强对高管自利行为的抑制能力,有效降低了高管薪酬。同时,管理者权力对独立董事信息共享机制的监督效力起到调节作用,具体表现为随着管理者权力的增强,独立董事信息共享对于高管薪酬的约束作用被弱化,这一结果说明独立董事信息共享机制的监督有效性受到管理者权力的限制。研究构建了独立董事信息共享指标,并基于董事会监督博弈过程分析信息共享对高管自利行为的约束过程,最后运用A股上市公司数据加以验证。研究拓展了对独立董事监督机制的认识,为打开董事会“黑箱”、提升董事会绩效提供新视角,促进公司治理机制由静态结构研究向动态过程研究转化。